package qujian;

import java.util.ArrayList;
import java.util.List;

/**
 * 986. 区间列表的交集
 * 输入：firstList = [[0,2],[5,10],[13,23],[24,25]], secondList = [[1,5],[8,12],[15,24],[25,26]]
 * 输出：[[1,2],[5,5],[8,10],[15,23],[24,24],[25,25]]

 * @author luolidong
 * @version 1.0
 * @create 2021-08-03 16:15
 */
public class L986 {
    public int[][] intervalIntersection(int[][] firstList, int[][] secondList) {
        List<int[]> list=new ArrayList<>();
        return firstList;
    }
}
